package Lee_code;

public class Lee_509 {
    public int fib(int n)
    {
        return dfs(n);
    }
    int dfs(int n)
    {
        if(n==0)
            return 0;
        if(n==1)
            return 1;
        return (dfs(n-1) + dfs(n-1));
    }
}
